The mixed capacitated general routing problem with turn penalties
نویسندگان
چکیده
منابع مشابه
The mixed capacitated general routing problem with turn penalties
0957-4174/$ see front matter 2011 Elsevier Ltd. A doi:10.1016/j.eswa.2011.04.092 ⇑ Corresponding author. Tel.: +34963877007x7666 E-mail addresses: [email protected] (O. Bräy Martínez), [email protected] (Y. Nagata), dsole In this paper we deal with the mixed capacitated general routing problem with turn penalties. This problem generalizes many important arc and node routing proble...
متن کاملThe mixed capacitated general routing problem under uncertainty
We study the General Routing Problem defined on a mixed graph and with stochastic demands. The problem under investigation is aimed at finding the minimum cost set of routes to satisfy a set of clients whose demand is not deterministically known. Since each vehicle has a limited capacity, the demand uncertainty occurring at some clients affects the satisfaction of the capacity constraints, that...
متن کاملA matheuristic algorithm for the mixed capacitated general routing problem
We study the general routing problem de ned on a mixed graph and subject to capacity constraints. Such a problem aims to nd the set of routes of minimum overall cost servicing a subset of required elements like vertices, arcs and edges, without exceeding the capacity of a eet of homogeneous vehicles based at the same depot. The problem is a generalization of a large variety of node and arc rout...
متن کاملModeling and solving the mixed capacitated general routing problem
We tackle the Mixed Capacitated General Routing Problem (MCGRP) which generalizes many other routing problems. Very few papers have been devoted to this argument, in spite of interesting real-world applications. We propose an integer programming model for the MCGRP and extend to its polyhedron inequalities valid for the Capacitated Arc Routing Problem (CARP) polyhedron. Identification procedure...
متن کاملThe mixed capacitated arc routing problem with non-overlapping routes
Real world applications for vehicle collection or delivery along streets usually lead to arc routing problems, with additional and complicating constraints. In this paper we focus on arc routing with an additional constraint to identify vehicle service routes with a limited number of shared nodes, i.e. vehicle service routes with a limited number of intersections. This constraint leads to solut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Expert Systems with Applications
سال: 2011
ISSN: 0957-4174
DOI: 10.1016/j.eswa.2011.04.092